A hybrid entropic proximal decomposition method with self-adaptive strategy for solving variational inequality problems
نویسندگان
چکیده
منابع مشابه
A Proximal Decomposition Method for Solving Convex Variational Inverse Problems
A broad range of inverse problems can be abstracted into the problem of minimizing the sum of several convex functions in a Hilbert space. We propose a proximal decomposition algorithm for solving this problem with an arbitrary number of nonsmooth functions and establish its convergence. The algorithm fully decomposes the problem in that it involves each function individually via its own proxim...
متن کاملA Hybrid LQP Alternating Direction Method for Solving Variational Inequality Problems with Separable Structure
In this paper, we presented a logarithmic-quadratic proximal alternating direction method for structured variational inequalities. The method generates the new iterate by searching the optimal step size along the descent direction. Global convergence of the new method is proved under certain assumptions.
متن کاملA hybrid method without extrapolation step for solving variational inequality problems
In this paper, we introduce a new method for solving variational inequality problems with monotone and Lipschitz-continuous mapping in Hilbert space. The iterative process is based on two well-known projection method and the hybrid (or outer approximation) method. However we do not use an extrapolation step in the projection method. The absence of one projection in our method is explained by sl...
متن کاملA Hybrid Newton Method for Solving Box Constrained Variational Inequality Problems via the D-gap Function
A box constrained variational inequality problem can be reformulated as an unconstrained minimization problem through the D-gap function. A hybrid Newton-type method is proposed for minimizing the D-gap function. Under suitable conditions, the algorithm is shown to be globally convergent and locally quadratically convergent. Some numerical results are also presented.
متن کاملEntropic proximal decomposition methods for convex programs and variational inequalities
We consider convex optimization and variational inequality problems with a given separable structure. We propose a new decomposition method for these problems which combines the recent logarithmicquadratic proximal theory introduced by the authors with a decomposition method given by Chen-Teboulle for convex problems with particular structure. The resulting method allows to produce for the firs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2008
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2007.03.015